منابع مشابه
Partial updates
A datastructure instance, e.g. a set or file or record, may be modified independently by different parts of a computer system. The modifications may be nested. Such hierarchies of modifications need to be efficiently checked for consistency and integrated. This is the problem of partial updates in a nutshell. In our first paper on the subject, we developed an algebraic framework which allowed u...
متن کاملPartial Updates Exploration II
During one step of a powerful programming, specification or query language, the same mathematical object, like a set or map or sequence, may be modified – in parallel – by different parts of the program. Such partial updates need to be efficiently checked for consistency and integrated. This is the problem of partial updates in a nutshell. In our first paper on the subject we proposed a general...
متن کاملPartial Updates: Exploration
The partial update problem for parallel abstract state machines has manifested itself in the cases of counters, sets and maps. We propose a solution of the problem that lends itself to an eÆcient implementation and covers the three cases mentioned above. There are other cases of the problem that require a more general framework.
متن کاملAdaptive Filters Employing Partial Updates
{ In some adaptive ltering applications, the least-mean-square (LMS) algorithm may be too computationally-and memory-intensive to implement. In this paper , we analyze two adaptive algorithms that update only a portion of the coeecients of the adaptive lter per iteration. These algorithms use decimated versions of the error and regressor signals, respectively. Simulations verify the accuracy of...
متن کاملMaintaining Partial Path Consistency in STNs under Event-Incremental Updates
Efficient management of temporal constraints is important for temporal planning. During plan development, many solvers employ a heuristic-driven backtracking approach, over the course of which they maintain a so-called Simple Temporal Network (STN) of events and constraints. This paper presents the Vertex-IPPC algorithm, which efficiently enforces partial path consistency when an STN is extende...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.11.010